List total coloring of pseudo-outerplanar graphs
نویسنده
چکیده
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that every pseudo-outerplanar graph with maximum degree ∆ ≥ 5 is totally (∆ + 1)-choosable.
منابع مشابه
On Group Choosability of Total Graphs
In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures.We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs withou...
متن کاملTotal coloring of pseudo-outerplanar graphs
A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the total coloring conjecture is completely confirmed for pseudoouterplanar graphs. In particular, it is proved that the total chromatic number of every pseudo-...
متن کاملOn list-coloring extendable outerplanar graphs∗
We investigate a variation on Thomassen’s 2and 3-extendability of precoloring extensions for list-coloring graphs. For an outerplanar graph G with i, j ≤ 2, we say that G is {i, j}-extendable if for every pair of nonadjacent vertices x and y, whenever x is assigned an i-list, y is assigned a j-list, and all other vertices have a 3-list, G is list-colorable. We characterize the {1, 1}and the {1,...
متن کاملDefective List Colorings of Planar Graphs
We combine the concepts of list colorings of graphs with the concept of defective colorings of graphs and introduce the concept of defective list colorings. We apply these concepts to vertex colorings of various classes of planar graphs. A defective coloring with defect d is a coloring of the vertices such that each color class corresponds to an induced subgraph with maximum degree at most d. A...
متن کاملOn Coloring Squares of Outerplanar Graphs
We study vertex colorings of the square G of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G as a function of the maximum degree ∆ of G for all ∆ ∈ N. As a bonus, we obtain the optimal bound of the choosability (or the list-chromatic number) of G when ∆ ≥ 7. In the case of chordal outerplanar graphs, we classify exactly which g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 313 شماره
صفحات -
تاریخ انتشار 2013